A robust algorithm for finding the real intersections of three quadric surfaces

نویسندگان

  • Zhiqiang Xu
  • Xiaoshen Wang
  • Xiao-Diao Chen
  • Jia-Guang Sun
چکیده

By Bezout’s theorem, three quadric surfaces may have infinitely intersections, but have at most eight isolated intersections. In this paper, we present an efficient and robust algorithm to obtain the isolated and the connected components of the real intersections of three quadric surfaces. Moreover, the conditions under which the intersections are finite and infinite are thoroughly investigated. Furthermore, our method can be used to find the number of isolated real intersections.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing All Conic Sections in Torus and Natural Quadric Intersections

Conic sections embedded in a torus must be circles of special types: (i) proole circles, (ii) cross-sectional circles , and (iii) Yvone-Villarceau circles. Based on this classiication, we present eecient and robust geometric algorithms that detect and compute all degenerate conic sections (circles) in torus/plane and torus/natural-quadric intersections. 2 Introduction Simple surfaces (such as p...

متن کامل

L_1 operator and Gauss map of quadric surfaces

The quadrics are all surfaces that can be expressed as a second degree polynomialin x, y and z. We study the Gauss map G of quadric surfaces in the 3-dimensional Euclidean space R^3 with respect to the so called L_1 operator ( Cheng-Yau operator □) acting on the smooth functions defined on the surfaces. For any smooth functions f defined on the surfaces, L_f=tr(P_1o hessf), where P_1 is t...

متن کامل

Finding the real intersection of three quadrics using techniques from Real Algebraic Geometry

In this paper, we present a new algorithm for computing in a very efficient way the real intersection of three quadric surfaces. Our approach is based on the cylindrical decomposition ([4]) and the TOP algorithm ([10]) for analyzing the topology of a planar curve. We preform a symbolic pre-processing that allows us later to execute all numerical computations in a very accurate way.

متن کامل

Three-Dimensional Surface Recognition Based on Genetic Algorithms

A robust method for 3-D surface recognition based on genetic algorithms is proposed in this paper. With the help of a specilic least square fitting algorithm, the model-based 3-1) st,rfacc recognition problem is first converted into an optimization problem. Then. a genetic algorithm is used to solve the optimal problem in order to extract general quadric surfaces. Finally. all the extracted .~u...

متن کامل

Simultaneous robust estimation of multi-response surfaces in the presence of outliers

A robust approach should be considered when estimating regression coefficients in multi-response problems. Many models are derived from the least squares method. Because the presence of outlier data is unavoidable in most real cases and because the least squares method is sensitive to these types of points, robust regression approaches appear to be a more reliable and suitable method for addres...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2005